Perfect Subgroups of Hnn Extensions
نویسندگان
چکیده
This note includes supporting material for Guilbault’s one-hour talk summarized elsewhere in these proceedings. We supply the group theory necessary to argue that Guilbault’s tame ends cannot be pseudocollared. In particular, we show that certain groups (the interated Baumslag-Solitar groups) cannot have any non-trivial perfect subgroups. The absence of non-trivial perfect subgroups, in turn, eliminates the possibility of non-trivial homotopy equivalences. In contrast, we include an example of a pseudo-collared end based on groups (the interated Adam’s groups) that are somewhat similar to the Baumslag-Solitar groups. We close with a discussion of a homotopy theoretic approach to this construction.
منابع مشابه
Rational Subsets in HNN-Extensions and Amalgamated Products
of a group H, where A and B are isomorphic subgroups of H and φ : A → B is an isomorphism, results from adding to H a new generator t such that the conjugation of the subgroup A ≤ H by t realizes the isomorphism φ. We also say that A and B in (2) are the associated subgroups. One of the first important applications of HNN-extensions was a more transparent proof of the celebrated result of Novik...
متن کامل. G R ] 1 N ov 2 00 4 RELATIVE DEHN FUNCTIONS OF AMALGAMATED PRODUCTS AND HNN – EXTENSIONS
We obtain an upper bound for relative Dehn functions of amalgamated products and HNN–extensions with respect to certain collections of subgroups. Our main results generalize the combination theorems for relatively hyperbolic groups proved by Dahmani.
متن کاملSubgroup Separability and Conjugacy Separability of Certain HNN Extensions
In this note, we give characterizations for certain HNN extensions of polycyclic-by-finite groups with central associated subgroups to be subgroup separable and conjugacy separable. We shall do this by showing the equivalence of subgroup separability and conjugacy separability in this type of HNN extensions. 2000 Mathematics Subject Classification: Primary 20E06, 20E26; Secondary 20F10, 20F19
متن کاملDivisibility Theory and Complexity of Algorithms for Free Partially Commutative Groups
3.3. The greatest common divisor and the least common multiple 12 3.4. Parabolic divisors 14 3.5. Divisibility: further properties 14 4. Normal forms arising from HNN extensions 16 4.1. HNN -normal form 16 5. Conjugacy problem 18 5.1. Conjugacy Criterion for HNN -extensions 18 5.2. Block decomposition 22 5.3. Conjugacy with respect to a subgroup 23 5.4. An algorithm for solving the Conjugacy Pr...
متن کاملKnapsack in Graph Groups, HNN-Extensions and Amalgamated Products
It is shown that the knapsack problem, which was introduced by Myasnikov et al. for arbitrary finitely generated groups, can be solved in NP for graph groups. This result even holds if the group elements are represented in a compressed form by SLPs, which generalizes the classical NP-completeness result of the integer knapsack problem. We also prove general transfer results: NP-membership of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005